Architectural Support for Data-Driven Execution
نویسندگان
چکیده
منابع مشابه
Architectural Support for Data Mining
One of the main obstacles in applying data mining techniques to large, real-world databases is the lack of efficient data management. In this paper, we present the design and implementation of an effective two-level architecture for a data mining environment. It consists of a mining tool and a parallel DBMS server. The mining tool organize= and controls the search process, while the DBMS provid...
متن کاملModified Architectural Support for predicate execution of Instruction level parallelism
Utilizing speculative execution alone to extract instruction level parallelism in the presence of branches has performance limitation .The fundamental limitation is that speculation eliminates dependencies between instructions and branches, but does not remove the branches themselves. To overcome this drawback, predicate execution is investigated. Predicate or guarded execution enables a compil...
متن کاملAn Architectural Style for Data-Driven Systems
Data-driven systems and applications are specialized software solutions for acquisition, management, and presentation of information. These systems are usually developed using the same software tools, technologies, and processes used for creating any other type of software. Not only is this approach inefficient, but also it results in extreme redundancies due to the inherently repetitive nature...
متن کاملDependence Driven Execution for Data Parallelism
This paper proposes an efficient run-time system to schedule general nested loops on multiprocessors. The work extends existing one-dimensional loop scheduling strategies such as static scheduling, affinity scheduling and various dynamic scheduling methods. The extensions are twofold. First, multiple independent loops as found in different branches of parbegin/parend constructs can be scheduled...
متن کاملArchitectural Support for Thread-level Data Speculation
Thread-Level Data Speculation (TLDS) is a technique which enables the optimistic parallelization of applications despite uncertainty as to whether data dependences exist between the resulting threads which would normally make them unsafe to execute in parallel. The basic idea is to speculate that dependences do not exist, and to then recover and restart whenever dependences do occur dynamically...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Architecture and Code Optimization
سال: 2015
ISSN: 1544-3566,1544-3973
DOI: 10.1145/2686874